On the upper chromatic number of (v3,b2)-configurations
نویسندگان
چکیده
منابع مشابه
Two Upper Bounds on the Chromatic Number
Processor cache memory management is a challenging issue as it deeply impact performances and power consumption of electronic devices. It has been shown that allocating data structures to memory for a given application (as MPEG encoding, filtering or any other signal processing application) can be modeled as a minimum k-weighted graph coloring problem, on the so-called conflict graph. The graph...
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
On the Upper Chromatic Number of Uniform Hypergraphs
In this paper we determine some necessary conditions for a uniform hypergraph to have a given upper chromatic number. Mathenmatics Subject Classification: 05C05
متن کاملOn the upper chromatic number of a hypergraph
We introduce the notion of a of a hypergraph, which is a subset of vertices to be colored so that at least two vertices are of the same color. Hypergraphs with both and are called mixed hypergraphs. The maximal number of colors for which there exists a mixed hypergraph coloring using all the colors is called the upper chromatic number of a hypergraph H and is denoted by X(H). An algorithm for c...
متن کاملA new upper bound on the cyclic chromatic number
A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χc . Let ∗ be themaximum face degree of a graph. There exist plane graphs with χc = 2 ∗ . Ore and Plummer [5] proved that χc ≤ 2 ∗, which bound was improved to 5 ∗ by Borodin, Sand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00275-x